Triangulations, visibility graph and reflex vertices of a simple polygon
نویسندگان
چکیده
منابع مشابه
A simple kinetic visibility polygon
! " # %$& (') * + , -. ('0/ '1 2 3 %$4 52 /6 3 % & 4 7 89 & : ;< %$& = : > >;2'1 ; ? @ A CB*'1 = = : ;D E< -+'1 4 GFIH J K & = :5L /< = %$9 = 3 %$ M = 4 ON ,P 052 = ') ; M!'1 ; ? 0 Q ? = ? ! F Categories and Subject Descriptors R S TLS TJU V WYX1Z&[K\9Z0]_^_Z)`#acbed f4d g%Z)hji kmlmn0oKp*q1rOs*r(tKuvl p*w tKx=s*y=z4{3r oKn0|9}~x=t &p* { t {34p* 1s*yGqL 0M: & 3 / : = ? / %$ J 05
متن کاملA randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon
We present a randomized algorithm to compute a clique of maximum size in the visibility graph G of the vertices of a simple polygon P . The input of the problem consists of the visibility graph G, a Hamiltonian cycle describing the boundary of P , and a parameter δ ∈ (0, 1) controlling the probability of error of the algorithm. The algorithm does not require the coordinates of the vertices of P...
متن کاملThe visibility region of points in a simple polygon
Let R be a polygonal region with h polygonal holes and n vertices in total, and let P be a set of m point guards in the interior of R. We show that the region of all points in R visible from at least one guard in P has at most n+ 2mn+ 4 h+2 2 m 2 vertices and can be computed in time O(((m(h+ 1))2 +mn logm) log(m+n)).
متن کاملCoherent and Exact Polygon-to-Polygon Visibility
Visibility computation is a classical problem in computer graphics. A wide variety of algorithms provides solutions with a different accuracy. However, the four dimensional nature of the 3D visibility has prevented for a long time from leading to exact from-polygon visibility algorithms. Recently, the two first tractable solutions were presented by Nirenstein, then Bittner. Their works give the...
متن کاملSpace-efficient Algorithms for Visibility Problems in Simple Polygon
Given a simple polygon P consisting of n vertices, we study the problem of designing space-efficient algorithms for computing (i) the visibility polygon of a point inside P , (ii) the weak visibility polygon of a line segment inside P and (iii) the minimum link path between a pair of points inside P . For problem (i) two algorithms are proposed. The first one is an in-place algorithm where the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1996
ISSN: 0925-7721
DOI: 10.1016/0925-7721(95)00027-5